A fully distributed replica allocation scheme for an opportunistic network

نویسندگان

  • Ji-Hyeun Yoon
  • Jae-Ho Choi
  • Kwang-Jo Lee
  • Sung-Bong Yang
چکیده

An opportunistic network (OPPNET) consists of diverse mobile nodes with various mobility patterns. Numerous mobility patterns and the resource constraints of mobile nodes lead to network partitioning that result in system performance degradation including low data accessibility. In a traditional mobile ad hoc network (MANET) which is similar to an OPPNET, replica allocation schemes have been proposed to increase data accessibility. Although the schemes are efficient in a MANET, they may not be directly applicable to an OPPNET because the schemes are based on a grouping of mobile nodes. It is very difficult to build groups based on network topology in an OPPNET because a node in an OPPNET does not keep its network topology information. In this paper, we propose a novel replica allocation scheme for an opportunistic network called the Snooping-based Fully Distributed replica allocation scheme. The proposed scheme allocates replicas in a fully distributed manner without grouping to reduce the communication cost, and fetches allocated replicas utilizing a novel candidate list concept to achieve high data accessibility. In the proposed scheme, a node can fetch replicas opportunistically based on the candidate list. Consequently, the proposed replica allocation scheme achieves high data accessibility while reducing the communication cost significantly. Extensive simulation results demonstrate that the proposed scheme reduces the communication cost and improves data accessibility over traditional schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A scalable mobility-based replica allocation scheme in a mobile ad-hoc network

Various issues on network routing in a mobile ad-hoc network (MANET) have been studied with outstanding results. However, there is still room for improvement with regard to data accessibility, especially when the number of nodes increases in the network. To enhance the data accessibility in a MANET, a few replica allocation schemes have been proposed. In these schemes, the nodes are partitioned...

متن کامل

Neighborhood-Based Scalable Replica Allocation Scheme in Mobile Ad-hoc Networks

In mobile ad-hoc networks, data accessibility is lower than that in traditional fixed networks due to frequent network divisions. Several schemes have been proposed to improve the data accessibility by replicating data items. These schemes utilize grouping to achieve high data accessibility. Although the grouping is an effective way to obtain high data accessibility, it may lead to huge amount ...

متن کامل

Correlated Data Placement in Distributed Systems

In distributed systems, communication cost is one of the major concerns. Many existing research have been conducted on placement of data to reduce communication cost and improve performance in widely distributed systems. All these research works focus on independent data objects. However, data are correlated due to accesses from clients and the correlation has some impact on date placement. In ...

متن کامل

Design an Efficient Community-based Message Forwarding Method in Mobile Social Networks

Mobile social networks (MSNs) are a special type of Delay tolerant networks (DTNs) in which mobile devices communicate opportunistically to each other. One of the most challenging issues in Mobile Social Networks (MSNs) is to design an efficient message forwarding scheme that has a high performance in terms of delivery ratio, latency and communication cost. There are two different approaches fo...

متن کامل

Research of Survival-Time-Based Dynamic Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks

Power conservation and extending survival time are critical issues in mobile ad hoc networks, as the nodes are powered by battery only. In this paper, according to the mobility of nodes, the survival-time-based adaptive replica allocation algorithm is proposed. In the survival-time-based dynamic adaptive replica allocation algorithm, based on the locality of data access, the replica allocation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Wireless Networks

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2014